Reduced-complexity transmit-beamforming codebook search algorithm
نویسندگان
چکیده
منابع مشابه
Transmit Beamforming based on Fairness Switched Sub-Codebook
In this paper, we consider the technique of limited feedback Transmit Beamforming for MISO systems. In conventional schemes, all vectors of a large codebook, used for the feedback of the quantized channel state information, are broadcasted to all users, in a guard period which is followed by data burst period. *Instead of transmitting a high number of codevectors, the codebook is divided into s...
متن کاملReduced-complexity transmit/receive-diversity systems
We consider wireless systems with transmit and receive diversity. For reduction of complexity, we propose to use hybrid selection/maximal ratio transmission at one link end, choosing L out of N antennas. We analyze the performance of such systems, giving analytical bounds and comparing them to computer simulations. Outage probability, symbol error probability, and capacity are shown. We demonst...
متن کاملAn efficient codebook search algorithm for EVRC
In this paper, a fast implementation algorithm for EVRC encoder is presented. Among the routines of CELP-type speech coders, the fixed codebook search is the most computationally demanding. The fast algorithm developed in this study mainly concerns the fixed codebook search procedure. For efficient codebook search, two efficient schemes are developed: limiting the number of possible combination...
متن کاملLow-Complexity Reduced-Rank Beamforming Algorithms
A reduced-rank framework with set-membership filtering (SMF) techniques is presented for adaptive beamforming problems encountered in radar systems. We develop and analyze stochastic gradient (SG) and recursive least squares (RLS)-type adaptive algorithms, which achieve an enhanced convergence and tracking performance with low computational cost as compared to existing techniques. Simulations s...
متن کاملA Novel Algorithm for Fast Codebook Search
In this thesis, we propose an algorithm to reduce the complexity to search the most suitable codeword for a given codebook. It is proven in the thesis that about half codewords are eliminated in each iteration. In addition, we derive two lower bounds for the proposed algorithm and show that they reach the actual SNR loss in high resolution codebook. Furthermore, the complexity analysis and simu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2011
ISSN: 0013-5194
DOI: 10.1049/el.2011.1202